858C - Did you mean - CodeForces Solution


dp greedy implementation *1500

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
int main()
{
    std::string s, ss = "aeiou";
    std::cin >> s;
    for (int i = 0; i < s.size(); i++)
        if ((s[i] != s[i + 1] || s[i + 1] != s[i + 2]) && ss.find(s[i]) == -1 && ss.find(s[i + 1]) == -1 && ss.find(s[i + 2]) == -1 && s[i] != '\0' && s[i + 1] != '\0')
            std::cout << s[i] << s[i + 1] << " ", i++;
        else if (s[i] != '\0')
            std::cout << s[i];
}


Comments

Submit
0 Comments
More Questions

1399A - Remove Smallest
208A - Dubstep
1581A - CQXYM Count Permutations
337A - Puzzles
495A - Digital Counter
796A - Buying A House
67A - Partial Teacher
116A - Tram
1472B - Fair Division
1281C - Cut and Paste
141A - Amusing Joke
112A - Petya and Strings
677A - Vanya and Fence
1621A - Stable Arrangement of Rooks
472A - Design Tutorial Learn from Math
1368A - C+=
450A - Jzzhu and Children
546A - Soldier and Bananas
32B - Borze
1651B - Prove Him Wrong
381A - Sereja and Dima
41A - Translation
1559A - Mocha and Math
832A - Sasha and Sticks
292B - Network Topology
1339A - Filling Diamonds
910A - The Way to Home
617A - Elephant
48A - Rock-paper-scissors
294A - Shaass and Oskols